Offline and online scheduling of concurrent bag-of-tasks applications on heterogeneous platforms
نویسندگان
چکیده
II Binary search 4 II-A Proof of Theorem 2 . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 4 II-B Binary search with stretch-intervals . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 4 II-B.1 Within a stretch-interval . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 5 II-B.2 Binary search among stretch intervals . . . . . . . . . . . . . . . . . . . . . . . . 7
منابع مشابه
Offline and online scheduling of concurrent bags-of-tasks on heterogeneous platforms
Scheduling problems are already difficult on traditional parallel machines. They become extremely challenging on heterogeneous clusters, even when embarrassingly parallel applications are considered. In this paper we deal with the problem of scheduling multiple applications, made of collections of independent and identical tasks, on a heterogeneous master-worker platform. The applications are s...
متن کاملAn Efficient Genetic Algorithm for Task Scheduling on Heterogeneous Computing Systems Based on TRIZ
An efficient assignment and scheduling of tasks is one of the key elements in effective utilization of heterogeneous multiprocessor systems. The task scheduling problem has been proven to be NP-hard is the reason why we used meta-heuristic methods for finding a suboptimal schedule. In this paper we proposed a new approach using TRIZ (specially 40 inventive principles). The basic idea of thi...
متن کاملAn Efficient Genetic Algorithm for Task Scheduling on Heterogeneous Computing Systems Based on TRIZ
An efficient assignment and scheduling of tasks is one of the key elements in effective utilization of heterogeneous multiprocessor systems. The task scheduling problem has been proven to be NP-hard is the reason why we used meta-heuristic methods for finding a suboptimal schedule. In this paper we proposed a new approach using TRIZ (specially 40 inventive principles). The basic idea of thi...
متن کاملA Scheduling Algorithm for Running Bag-of-Tasks Data Mining Applications on the Grid
Data mining applications are composed of computing-intensive processing tasks, which are natural candidates for execution on high performance, high throughput platforms such as PC clusters and computational grids. Besides, some data-mining algorithms can be implemented as Bag-of-Tasks (BoT) applications, which are composed of parallel, independent tasks. Due to its own nature, the adaptation of...
متن کاملO -line and on-line scheduling on heterogeneous master-slave platforms
In this paper, we deal with the problem of scheduling independent tasks on heterogeneous master-slave platforms. We target both o -line and on-line problems, with several objective functions (makespan, maximum response time, total completion time). On the theoretical side, our results are two-fold: (i) For o line scheduling, we prove several optimality results for problems with release dates; (...
متن کامل